Pure-strategy Nash equilibria on competitive diffusion games
نویسندگان
چکیده
منابع مشابه
On Pure Nash Equilibria in Stochastic Games
Ummels andWojtczak initiated the study of findingNash equilibria in simple stochastic multi-player games satisfying specific bounds. They showed that deciding the existence of pure-strategy Nash equilibria (pureNE)where a fixed player wins almost surely is undecidable for games with 9 players. They also showed that the problem remains undecidable for the finite-strategy Nash equilibrium (finNE)...
متن کاملConstrained Pure Nash Equilibria in Polymatrix Games
We study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on incoming edges from players who picked the same strategy augmented by a fixed integer bonus for picking a given strategy. These games capture the idea of coord...
متن کاملPure Nash Equilibria in Concurrent Deterministic Games
We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a two-player turnbased game which turns Nash equilibria into winning strategies (for some objective that depends on the preference relations of the players in t...
متن کاملConstrained Pure Nash Equilibria in Graphical Games
The rational behavior of non-cooperative players is often formalized by means of the game theoretic notion of Nash equilibrium. However, there are several practical applications (e.g., multiagent planning, mechanism design, and routing protocols design), where the computation of any Nash equilibrium could not be satisfactory, since we are often interested only in equilibria that satisfy some ad...
متن کاملGames on Graphs The Complexity of Pure Nash Equilibria
In this thesis, we analyze the problem of computing pure Nash equilibria in succinctly representable games, with a focus on graphical and action-graph games. While the problem is NP-Complete for both models, it is known to be polynomial time computable when restricted to games of bounded treewidth. We propose a dynamic programming approach for computing pure Nash equilibria of graphical games. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.03.031